Similarity Between Pairs Of Co-Indexed Trees For Textual Entailment Recognition
نویسندگان
چکیده
In this paper we present a novel similarity between pairs of co-indexed trees to automatically learn textual entailment classifiers. We defined a kernel function based on this similarity along with a more classical intra-pair similarity. Experiments show an improvement of 4.4 absolute percent points over state-of-the-art methods.
منابع مشابه
SemKer: Syntactic/Semantic Kernels for Recognizing Textual Entailment
In this paper we describe the SemKer system participating to the fifth Recognizing of Textual Entailment (RTE5) challenge. The major novelty with respect to the systems with which we participated to the previous challenges is the use of semantic knowledge based on Wikipedia. More specifically, we used it to enrich the similarity measure between pairs of text and hypothesis (i.e. the tree kernel...
متن کاملLarge-Scale Verb Entailment Acquisition from the Web
Textual entailment recognition plays a fundamental role in tasks that require indepth natural language understanding. In order to use entailment recognition technologies for real-world applications, a large-scale entailment knowledge base is indispensable. This paper proposes a conditional probability based directional similarity measure to acquire verb entailment pairs on a large scale. We tar...
متن کاملThe Effect of Semantic Knowledge Expansion to Textual Entailment Recognition
This paper studies the effect of semantic knowledge expansion applied to the Textual Entailment Recognition task. In comparison to the already existing approaches we introduce a new set of similarity measures that captures hidden semantic relations among different syntactic categories in a sentence. The focus of our study is also centred on the synonym, antonym and verb entailment expansion of ...
متن کاملEncoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case
In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vec...
متن کاملString Re-writing Kernel
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referred to as string re-writing kernel, to address the problem. A string re-writing kernel measures the similarity between two pairs of strings, each pair representing re-writing of a string. It can capture the lexical and s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006